Structural Similarity in Context-Free Languages
نویسنده
چکیده
Divide the context-free languages into equivalence classes in the following way: L1 and L2 are in the same class if there are a-transducers M and M such that M(L1) ~ L~ and d~r(L,) = L1. Define L1 and L~ to be structurally similar if they are in the same class. Among the results given below are: (I) if L1 and L2 are structurally similar and L1 has a structurally similar set of (right) sententiat forms then so does L2 ; (2) i fL 1 and L2 are structurally similar and L1 is deterministic, then L2 has a structurally similar set of right sentential forms; (3) ilL1 and L2 are structurally similar and L1 is a parenthesis language then Le has a structurally similar set of sentential forms; (4) there is a nonempty equivalence class of structurally similar languages that contains no (right) sentential forms of any grammar; (5) if an equivalence class contains any set of (right) sentential forms at all then every language in the class has a set of (right) sentential forms in that class.
منابع مشابه
Bond-Free Languages: Formalizations, Maximality and Construction Methods
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA computations. We recall a few existing formalizations of the problem and then define the property of sim-bond-freedom, where sim is a similarity relation between words. We show that this property is decidable for context-...
متن کاملThe Dissecting Power of Regular Languages
A study on structural properties of regular and context-free languages has promoted our basic understandings of the complex behaviors of those languages. We continue the study to examine how regular languages behave when they are “almost halving” numerous infinite languages. In particular, we are focused on a situation in which a regular language “dissects” a target infinite language into two i...
متن کاملLearning Languages by Collecting Cases andTuning
We investigate the problem of case-based learning of formal languages. Case-based reasoning and learning is a currently booming area of artiicial intelligence. The formal framework for case-based learning of languages has recently been developed by JL93] in an inductive inference manner. In this paper, we rst show that any indexed class of recursive languages in which niteness is decidable is c...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملNon-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages
For the class of linear context-free tree grammars, we define a decidable property called self-embedding. We prove that each non-self-embedding grammar in this class generates a regular tree language and show how to construct the equivalent regular tree grammar.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information and Control
دوره 30 شماره
صفحات -
تاریخ انتشار 1976